Hard Constraints Mirror Soft Constraints!
ثبت نشده
چکیده
Person-based split-ergativity is one of a number of linguistic phenomena which reflect the general tendency, first noted in Silverstein 1976, for the hierarchy of grammatical functions to be “aligned” with hierarchies of other linguistic substance, such as person. A diachronic, usage based explanation is offered both for the existence of personbased split-ergative systems and for the absence of systems exhibiting the reversal of this marking pattern. This account may be distinguished by its use of a particular grammatical framework, Stochastic Optimality Theory, to provide precise analyses both of the personbased split-ergative system’s synchronic status and also of the process of reanalysis by which, over a period of time, a statistical regularity in language use may be transformed into an obligatory grammatical rule.
منابع مشابه
بهینه سازی برنامه ریزی هفتگی دروس دانشگاهی با روشهای جستجوی محلی
University course timetabling problem is a complicated problem and finding a computer-aided solution for it was a subject to work for many years. To solve this problem, we must assign courses to timeslots with respect to hard and soft constraints. Hard constraints are those which must be necessarily met (some of them could be neglected with high costs). Our aim is to meet as many soft constrain...
متن کاملDistributed Hard and Soft Non-binary Constraints: An Any-Time Proposal
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constraints. Hard constraints must hold while soft constraints may be violated but as many as possible should be satisfied. Although the problem constraints can be divided into two groups, the order in which these constrain...
متن کاملScheduling with Soft CLP(FD) Solver*
Timetabling problems often consists from various requirements which can not be satisfied together [11]. Unsatisfiable requirements can be handled within optimization criteria as soft constraints. Such soft constraints may not be satisfied if there are some contradictions. The remaining hard constraints must be still satisfied. The set of hard and soft constraints can be naturally expressed usin...
متن کاملDistributed Non-binary Constraints
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constraints. Hard constraints must hold while soft constraints may be violated but as many as possible should be satisfied. Although the problem constraints can be divided into two groups, the order in which these constrain...
متن کاملQuantitative Non-diagonal Regulator Design for Uncertain Multivariable System with Hard Time-domain Constraints
In this paper a non-diagonal regulator, based on the QFT method, is synthesized for an uncertain MIMO plant whose output and control signals are subjected to hard time-domain constraints. This procedure includes the design of a non-diagonal pre-controller based on a new simple approach, followed by the sequential design of a diagonal QFT controller. We present a new formulation for the latter s...
متن کاملGenerating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
متن کامل